Large Populations Are Not Always The Best Choice In Genetic Programming
نویسنده
چکیده
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinatory logic, previously successfully tackled with genetic programming, which seem to defy this consensus. Our experimental data gives evidence that smaller populations are competitive or even slightly better. Moreover, hill-climbing appears to exhibit the best performance. While these results are in a way unexpected, theoretical considerations provide a possible explanation in terms of a special constellation rather than a general misconception as to the bene ts of large populations or genetic programming as such.
منابع مشابه
A Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملCell forming and cell balancing of virtual cellular manufacturing systems with alternative processing routes using genetic algorithm
Cellular manufacturing (CM) is one of the most important subfields in the design of manufacturing systems and as a recently emerged field of study and practice, virtual cellular manufacturing (VCM) inherits the importance from CM. One type of VCM problems is VCM with alternative processing routes from which the route for processing each part should be selected. In this research, a bi-objective ...
متن کاملA Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کاملDAMAGE AND PLASTICITY CONSTANTS OF CONVENTIONAL AND HIGH-STRENGTH CONCRETE PART II: STATISTICAL EQUATION DEVELOPMENT USING GENETIC PROGRAMMING
Several researchers have proved that the constitutive models of concrete based on combination of continuum damage and plasticity theories are able to reproduce the major aspects of concrete behavior. A problem of such damage-plasticity models is associated with the material constants which are needed to be determined before using the model. These constants are in fact the connectors of constitu...
متن کاملGlobal Supply Chain Management under Carbon Emission Trading Program Using Mixed Integer Programming and Genetic Algorithm
In this paper, the transportation problem under the carbon emission trading program ismodelled by mathematical programming and genetic algorithm. Since green supply chain issuesbecome important and new legislations are taken into account, carbon emissions costs are included inthe total costs of the supply chain. The optimisation model has the ability to minimise the total costsand provides the ...
متن کامل